Recursion and the infinitude claim∗
نویسندگان
چکیده
(2) This property of discrete infinity characterizes EVERY human language; none consists of a finite set of sentences. The unchanged central goal of linguistic theory over the last fifty years has been and remains to give a precise, formal characterization of this property and then to explain how humans develop (or grow) and use discretely infinite linguistic systems. (Epstein and Hornstein 2005: 4)
منابع مشابه
Contrasting Applications of Logic in Natural Language Syntactic Description∗
Formal syntax has hitherto worked mostly with theoretical frameworks that take grammars to be generative, in Emil Post’s sense: they provide recursive enumerations of sets. This work has its origins in Post’s formalization of proof theory. There is an alternative, with roots in the semantic side of logic: model-theoretic syntax (MTS). MTS takes grammars to be sets of statements of which (algebr...
متن کاملSquarefree Smooth Numbers and Euclidean Prime Generators
We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes.
متن کاملResolving the Infinitude Controversy
A simple inductive argument shows natural languages to have infinitly many sentences, but workers in the field have uncovered clear evidence of a diverse group of ‘exceptional’ languages from Proto-Uralic to Dyirbal and most recently, Pirahã, that appear to lack recursive devices entirely. We argue that in an information-theoretic setting non-recursive natural languages appear neither exception...
متن کاملFrom Euclid to Present: A Collection of Proofs regarding the Infinitude of Primes
Prime numbers are considered the basic building blocks of the counting numbers, and thus a natural question is: Are there infinitely many primes? Around 300BC, Euclid demonstrated, with a proof by contradiction, that infinitely many prime numbers exist. Since his work, the development of various fields of mathematics has produced subsequent proofs of the infinitude of primes. Each new and uniqu...
متن کاملCalculation for Energy of (111) Surfaces of Palladium in Tight Binding Model
In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...
متن کامل